ATTRIBUTE BASED ENCRYPTION USING MODIFIED HOMOMORPHIC ALGORITHM
نویسندگان
چکیده
منابع مشابه
Targeted Homomorphic Attribute-Based Encryption
In (key-policy) attribute based encryption (ABE), messages are encrypted respective to attributes x, and keys are generated respective to policy functions f . The ciphertext is decryptable by a key only if f(x) = 0. Adding homomorphic capabilities to ABE is a long standing open problem, with current techniques only allowing compact homomorphic evaluation on ciphertext respective to the same x. ...
متن کاملAttribute-Based Group Homomorphic Encryption and Additively Homomorphic IBE
Group Homomorphic Encryption (GHE), formally defined by Armknecht, Katzenbeisser and Peter, is a public-key encryption primitive where the decryption algorithm is a group homomorphism. Hence it suports homomorphic evaluation of a single algebraic operation such as modular addition or modular multiplication. Most classical homomorphic encryption schemes such as as Goldwasser-Micali and Paillier ...
متن کاملFully Dynamic Multi Target Homomorphic Attribute-Based Encryption
We propose multi target homomorphic attribute-based encryption (MT-HABE) with fully dynamic homomorphic evaluation: it can take as input arbitrary additional ciphertexts during homomorphic computation. In the previousMT-HABE of Brakerski et al. (TCC 2016-B), the output of homomorphic computation, which is related to a policy set, cannot be computedwith a fresh ciphertext whose attribute does no...
متن کاملPrivacy Preserving using Homomorphic Encryption
In the recent time, privacy preserving has been studied extensively, because of the extensive explosion of sensitive information. Privacy preserving is one of the important areas that aim to provide security for secret information from unsolicited or unsanctioned disclosure. This has triggered the development of much privacy preserving technique using encryption algorithm. This work will presen...
متن کاملAttribute-based encryption implies identity-based encryption
In this short paper we formally prove that designing attribute-based encryption schemes cannot be easier than designing identity-based encryption schemes. In more detail, we show how an attribute-based encryption scheme which admits, at least, AND policies can be combined with a collision-resistant hash function to obtain an identity-based encryption scheme. Even if this result may seem natural...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2017
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2017.0603013